Studies in graph theory

Polyhedral studies in Domination Graph Theory (I)

This paper discusses polyhedral approaches to problems in Domination Graph Thoery. We give various linear integer programming formulations for the weighted and unweighted versions of the minimum dominating set problem. We study the associated polytopes and determine dimension of the polytopes, facets, valid inequalities et al. Ideas from integer programming such as lift and project are used to ...

An Introduction to Graph Theory in Complex Systems Studies

Graphs are a fundamental construct in complex systems research, and the use of graph theoretic algorithms and metrics to extract useful information from a problem is a primary method of analysis for complex systems. As with all problem representations, a graphbased representation is used to provide a particular perspective on a problem. Whether or not a graph-theoretic representation is useful ...

Appraisal Theory in Translation Studies: An Introduction and Review of Studies of Evaluation in Translation

Translation studies (TS), as a young (inter)discipline, has partly relied on metadiscussions, critical assessments of its literature, and compilation of bibliographies to deal with certain problems of its youth, such as polarity and fragmentation. While the current status of TS shows general maturity, there are still young areas of inquiry in the discipline that are faced with similar issues. T...

Algorithms in Graph Theory

Topics in Graph Theory

Abstract. This paper is an exposition of some classic results in graph theory and their applications. A proof of Tutte’s theorem is given, which is then used to derive Hall’s marriage theorem for bipartite graphs. Some compelling applications of Hall’s theorem are provided as well. In the final section we present a detailed proof of Menger’s theorem and demonstrate its power by deriving König’s...